Finite axiom systems for testing preorder and De Simone process languages
نویسندگان
چکیده
منابع مشابه
Finite Axiom Systems for Testing Preorder and De Simone Process Languages
We prove that testing preorder of De Nicola and Hennessy is preserved by all De Simone process operators. Based on this result we propose an algorithm for generating axiomatisations of testing preorder for arbitrary De Simone process languages. The axiom systems produced by our algorithm are nite and complete for processes with nite behaviour. In order to achieve completeness for a subclass of ...
متن کاملAxiomatisations of Weak Equivalences for De Simone Languages
Aceto, Bloom and Vaandrager proposed in ABV92] a procedure for generating a complete axiomatisation of strong bisimulation for process languages in the GSOS format. However, the choice operator +, which the procedure uses, as well as other auxiliary GSOS operators, which it introduces to obtain a nite axiomatisation, do not preserve many of weak equivalences. We propose a modiication of this pr...
متن کاملA precongruence format for should testing preorder
Should testing preorder was proposed as a liveness-preserving precongruence for a process algebra except for nondeterministic choice operator [22]. However, this precongruce result cannot be generalized to other languages before carefully proved. In this paper, we show that τDes format is a precongruence format for should testing preorder. A precongruence format guarantees the precongruence of ...
متن کاملAxiom - based Unit Testing
This chapter presents a case-study of how the abstractions and infrastructure discussed in Part III and Part IV of this dissertation may be applied to source code analysis and interactive code generation. The motivation for the case study prototype, an interactive unit test generator, is that current unit testing methodologies often result in poor test coverage due to rather ad-hoc approaches.
متن کاملSimulation Preorder on Simple Process Algebras
We consider the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones. We prove that simulation preorder (in both directions) and simulation equivalence are intractable between all major classes of infinite-state systems and finite-state ones. This result is obtained by showing that the problem whether a BPA (or BPP) process simulates a finitestate on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00214-5